Decision Rules Acquisition for Inconsistent Disjunctive Set-Valued Ordered Decision Information Systems
نویسندگان
چکیده
منابع مشابه
On Dominance Relations in Disjunctive Set-Valued Ordered Information Systems
Set-valued information systems are generalized models of single-valued information systems. Its semantic interpretation can be classified into two categories: disjunctive and conjunctive. We focus on the former in this paper. By introducing four types of dominance relations to the disjunctive set-valued information systems, we establish a dominance-based rough sets approach, which is mainly bas...
متن کاملSet-valued ordered information systems
Set-valued ordered information systems can be classified into two categories: disjunctive and conjunctive systems. Through introducing two new dominance relations to set-valued information systems, we first introduce the conjunctive/disjunctive set-valued ordered information systems, and develop an approach to queuing problems for objects in presence of multiple attributes and criteria. Then, w...
متن کاملDecision Rules Acquisition Based on Consistent Objects in Ordered Information Systems with Fuzzy Decisions ⋆
In an Ordered Decision Information System (ODIS), upper (lower) consistent objects are considered, and used to cope with inconsistency of the system and draw “at least” (“at most”) decision rules. The upper (lower) consistent objects are described by generalized decisions of the objects, and thereby generalized conveniently to the Ordered Decision Information System with Fuzzy (FODIS) decisions...
متن کاملAttribute Reduction in Interval and Set-Valued Decision Information Systems
In many practical situation, some of the attribute values for an object may be interval and set-valued. This paper introduces the interval and set-valued information systems and decision systems. According to the semantic relation of attribute values, interval and set-valued information systems can be classified into two categories: disjunctive (Type 1) and conjunctive (Type 2) systems. In this...
متن کاملDecision Rules for Decision Tables with Many-Valued Decisions
The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/936340